On weighted path lengths and distances in increasing trees
نویسنده
چکیده
We study weighted path lengths (depths) and distances for increasing tree families. For those subclasses of increasing tree families, which can be constructed via an insertion process, e.g., recursive trees, plane-oriented recursive trees and binary increasing trees, we can determine the limiting distribution which can be characterized as a generalized Dickman’s infinitely divisible distribution.
منابع مشابه
Nodal distances for rooted phylogenetic trees
Dissimilarity measures for (possibly weighted) phylogenetic trees based on the comparison of their vectors of path lengths between pairs of taxa, have been present in the systematics literature since the early seventies. For rooted phylogenetic trees, however, these vectors can only separate non-weighted binary trees, and therefore these dissimilarity measures are metrics only on this class of ...
متن کاملExtremal Weighted Path Lengths in Random Binary Search Trees
We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path length to the minimal label has Dickman’s infinitely divisible distribution as a limit. By contrast, the weighted path length to the maximal label needs to be centered and scaled to converge to a standard normal variate in distribution. The exercise shows that path le...
متن کاملیک الگوریتم خطی برای مساله ی پیداکردن هسته ی درخت های بازه ای وزندار
In this paper we consider the problem of finding a core of weighted interval trees. A core of an interval graph is a path contains some intervals of graph so that the sum of distances from all intervals to this path is minimized. We show that intervals on core of a tree should be maximal, then a linear time algorithm is presented to find the core of interval trees
متن کاملLimit theorems for depths and distances in weighted random b-ary recursive trees
Limit theorems are established for some functionals of the distances between two nodes in weighted random b-ary recursive trees. We consider the depth of the nth node and of a random node, the distance between two random nodes, the internal path length and the Wiener index. As application these limit results imply by an imbedding argument corresponding limit theorems for further classes of rand...
متن کاملThe k-th Total Path Length and the Total Steiner k-Distance for Digital Search Trees
The total Steiner k-distance and the k-th total path length are the sum of the size of Steiner trees and ancestor-trees over sets of k nodes of a given tree, respectively. They are useful statistics with many applications. Consequently, they have been analyzed for many different random trees, including increasing tree, binary search tree, generalized m-ary search tree and simply generated trees...
متن کامل